Finite state incompressible infinite sequences
نویسندگان
چکیده
منابع مشابه
Inconstancy of finite and infinite sequences
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light a 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we introduce the inconstancy of a sequence and we show why it seems more pertinent than other criteria for measuring its variational complexity. We also compute ...
متن کاملOn Finite Representations of Infinite-State Behaviours
We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the cond...
متن کاملFinite-State Strategies in Regular Infinite Games
Abs t rac t . This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller automata and by game graphs (as introduced by McNaughton) is considered, and the construction of winning strategies is described in three stages, covering "guarantee games", "recurrence games", and generM regular ...
متن کاملFinite-State Automata on Infinite Inputs
This paper is a self-contained introduction to the theory of finite-state automata on infinite words. The study of automata on infinite inputs was initiated by Büchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed intere...
متن کاملSynchronizable Test Sequences of Finite State Machines
The finite state machine (FSM) model is commonly used for specifying communication protocols and other types of distributed systems. With the use of multiple testers for an FSM, the synchronization between inputs from different testers becomes a problem. A synchronizable test sequence of an FSM is a test sequence for which the synchronization problem either does not exist or can be solved by co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2016
ISSN: 0890-5401
DOI: 10.1016/j.ic.2015.11.003